Adding possibilistic knowledge to probabilities makes many problems algorithmically decidable
نویسندگان
چکیده
Many physical theories accurately predict which events are possible and which are not, or – in situations where probabilistic (e.g., quantum) effects are important – predict the probabilities of different possible outcomes. At first glance, it may seem that this probabilistic information is all we need. We show, however, that to adequately describe physicists’ reasoning, it is important to also take into account additional knowledge – about what is possible and what is not. We show that this knowledge can be described in terms of possibility theory, and that the presence of this knowledge makes many problems algorithmically decidable.
منابع مشابه
An Alternative Proof Method for Possibilistic Logic and its Application to Terminological Logics
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be es timated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possi bility degree or a necessity degree that ex presses to what extent the formula is pos sibly or necessarily true. Possibilistic reso lution yields a calculus for pos...
متن کاملImage Segmentation: Type–2 Fuzzy Possibilistic C-Mean Clustering Approach
Image segmentation is an essential issue in image description and classification. Currently, in many real applications, segmentation is still mainly manual or strongly supervised by a human expert, which makes it irreproducible and deteriorating. Moreover, there are many uncertainties and vagueness in images, which crisp clustering and even Type-1 fuzzy clustering could not handle. Hence, Type-...
متن کاملProbabilistic-Possibilistic Belief Networks
The interpretation of membership functions of fuzzy sets as statistical likelihood functions leads to a probabilistic-possibilistic hierarchical description of uncertain knowledge. The fundamental advantage of the resulting fuzzy probabilities with respect to imprecise probabilities is the ability of using all the information provided by the data. This paper studies the possibility of using fuz...
متن کاملEfficient Query Computing for Uncertain Possibilistic Databases with Provenance
We propose an extension of possibilistic databases that also includes provenance. The introduction of provenance makes our model closed under selection with equalities, projection and join. In addition the computation of query computing with possibilities is polynomial, in contrast with current models that combine provenance with probabilities and have#P complexity.
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کامل